Jump-Sparse and Sparse Recovery Using Potts Functionals

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The L-potts Functional for Robust Jump-sparse Reconstruction

We investigate the non-smooth and non-convex L1-Potts functional in discrete and continuous time. We show Γ-convergence of discrete L1-Potts functionals towards their continuous counterpart and obtain a convergence statement for the corresponding minimizers as the discretization gets ner. For the discrete L1-Potts problem, we introduce an O(n2) time and O(n) space algorithm to compute an exact ...

متن کامل

The L1-Potts Functional for Robust Jump-Sparse Reconstruction

We investigate the nonsmooth and nonconvex L1-Potts functional in discrete and continuous time. We show Γ-convergence of discrete L1-Potts functionals toward their continuous counterpart and obtain a convergence statement for the corresponding minimizers as the discretization gets finer. For the discrete L1-Potts problem, we introduce an O(n2) time and O(n) space algorithm to compute an exact m...

متن کامل

Sparse signal recovery using sparse random projections

Sparse signal recovery using sparse random projections

متن کامل

Sparse Recovery Using Sparse Random Matrices

Over the recent years, a new *linear* method for compressing high-dimensional data (e.g., images) has been discovered. For any high-dimensional vector x, its *sketch* is equal to Ax, where A is an m x n matrix (possibly chosen at random). Although typically the sketch length m is much smaller than the number of dimensions n, the sketch contains enough information to recover an *approximation* t...

متن کامل

Sparse Recovery

List of included articles [1] H. Rauhut. Random sampling of sparse trigonometric polynomials. Appl. Comput. [2] S. Kunis and H. Rauhut. Random sampling of sparse trigonometric polynomials II-orthogonal matching pursuit versus basis pursuit. [3] H. Rauhut. Stability results for random sampling of sparse trigonometric polynomi-als. [4] H. Rauhut. On the impossibility of uniform sparse reconstruct...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 2014

ISSN: 1053-587X,1941-0476

DOI: 10.1109/tsp.2014.2329263